Efficient Regular Path Query Evaluation by Splitting with Unit-Subquery Cost Matrix

Efficient regular path query evaluation using path indexes

We demonstrate the use of localized path indexes in generating efficient execution plans for regular path queries. This study is motivated by both the practicality of this class of queries and by the current dearth of scalable solutions for their evaluation. Our proposed solution leverages widely available relational database technology and is often orders of magnitude faster than currently kno...

Query-Subquery Nets

We formulate query-subquery nets and use them to create the first framework for developing algorithms for evaluating queries to Horn knowledge bases with the properties that: the approach is goal-directed; each subquery is processed only once and each supplement tuple, if desired, is transferred only once; operations are done set-at-a-time; and any control strategy can be used. Our intention is...

Inventory Cost Evaluation Under VMI Program with Lot Splitting

  This paper aims to evaluate inventory cost of a Two-echelon serial supply chain system under vendor managed inventory program with stochastic demand, and examine the effect of environmental factors on the cost of overall system. For this purpose, we consider a two-echelon serial supply chain with a manufacturer and a retailer. Under Vendor managed inventory program, the decision on inventory ...

Efficient Evaluation of Regular Path Expressions on Streaming XML Data

Query Optimization in Oodbms: Identifying Subquery for Complex Query Management

This paper is based on relatively newer approach for query optimization in object databases, which uses query decomposition and cached query results to improve execution a query. Issues that are focused here is fast retrieval and high reuse of cached queries, Decompose Query into Sub query, Decomposition of complex queries into smaller for fast retrieval of result. Here we try to address anothe...